Horn Clause Belief Change: Contraction Functions

نویسنده

  • James P. Delgrande
چکیده

The standard (AGM) approach to belief change assumes that the underlying logic is at least as strong as classical propositional logic. This paper investigates an account of belief change, specifically contraction, where the underlying logic is that governing Horn clauses. Thus this work sheds light on the theoretical underpinnings of belief change by weakening a fundamental assumption of the area. This topic is also of independent interest since Horn clauses have been used in areas such as deductive databases and logic programming. It proves to be the case that there are two distinct classes of contraction functions for Horn clauses: e-contraction, which applies to entailed formulas, and i-contraction, which applies to formulas leading to inconsistency. E-contraction is applicable in yet weaker systems where there may be no notion of negation (such as in definite clauses). I-contraction on the other hand has severe limitations, which makes it of limited use as a belief change operator. In both cases we explore the class of maxichoice functions which, we argue, is the appropriate approach for contraction in Horn clauses theories.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Horn Clause Contraction Functions: Belief Set and Belief Base Approaches

Standard approachs to belief change assume that the underlying logic contains classical propositional logic. Recently there has been interest in investigating approaches to belief change, specifically contraction, in which the underlying logic is not as expressive as full propositional logic. In this paper we consider approaches to belief contraction in Horn knowledge bases. We develop two broa...

متن کامل

Horn Clause Contraction Functions

In classical, AGM-style belief change, it is assumed that the underlying logic contains classical propositional logic. This is clearly a limiting assumption, particularly in Artificial Intelligence. Consequently there has been recent interest in studying belief change in approaches where the full expressivity of classical propositional logic is not obtained. In this paper we investigate belief ...

متن کامل

Language Splitting and Relevance-Based Belief Change in Horn Logic

This paper presents a framework for relevance-based belief change in propositional Horn logic. We firstly establish a parallel interpolation theorem for Horn logic and show that Parikh’s Finest Splitting Theorem holds with Horn formulae. By reformulating Parikh’s relevance criterion in the setting of Horn belief change, we construct a relevance-based partial meet Horn contraction operator and p...

متن کامل

On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic

Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper we build on recent investigations by Delgrande on contraction for Horn logic. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. This result...

متن کامل

Definability of Horn Revision from Horn Contraction

In the AGM framework [Alchourrón and Makinson, 1985], a revision function can be defined directly through constructions like systems of spheres, epistemic entrenchment, etc., or indirectly through a contraction operation via the Levi identity. A recent trend is to construct AGM style contraction and revision functions that operate under Horn logic. A direct construction of Horn revision is give...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008